MMAP/(PH,PH)/1 Queue with Priority Loss through Feedback
نویسندگان
چکیده
In this paper, we consider two single server queueing systems to which customers of distinct priorities (P1 and P2) arrive according a Marked Markovian arrival process (MMAP). They are served phase type distributions. The probability P1 customer feedback is θ on completion his service. (P1) customers, as well P2 join the low priority queue. Low (P2) taken for service from head line whenever queue found be empty at epoch. We assume finite waiting space infinite customers. Two models discussed in paper. model I, that non-preemptive discipline II, follow preemptive policy. No permitted line. steady state these compared through numerical experiments reveal their respective performance characteristics.
منابع مشابه
A Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملPriority queue classes with priority update
A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...
متن کاملComposite Priority Queue
This paper presents formulas for calculating waiting time for customers in a queue with combined preemptive and head-ofline (nonpreemptive) priority scheduling disciplines and describes the reasoning behind them. This work has been applied in the development of programmable terminal control units. Introduction The development of programmable terminal control units has created the need for a new...
متن کامل2 Priority Queue
In the last lecture, we discussed algorithms for integer sorting. In this lecture we will discuss the relationship between integer sorting algorithms and priority queue data structures. It is obvious that fast priority queues imply fast sorting, since if a priority queue can do Insert and Deletemin in O(f(n)), then we can sort in O(nf(n)) by inserting all elements into the queue then calling De...
متن کاملProgram Synthesis with Priority Queue Training
We consider the task of program synthesis in the presence of a reward function over the output of programs, where the goal is to find programs with maximal rewards. We introduce an iterative optimization scheme, where we train an RNN on a dataset of K best programs from a priority queue of the generated programs so far. Then, we synthesize new programs and add them to the priority queue by samp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9151797